Orthogonal Polynomials on the Sierpinski Gasket

نویسندگان

  • KASSO A. OKOUDJOU
  • ROBERT S. STRICHARTZ
  • ELIZABETH K. TULEY
چکیده

Abstract. The construction of a Laplacian on a class of fractals which includes the Sierpinski gasket (SG) has given rise to an intensive research on analysis on fractals. For instance, a complete theory of polynomials and power series on SG has been developed by one of us and his coauthors. We build on this body of work to construct certain analogs of classical orthogonal polynomials (OP) on SG. In particular, we investigate key properties of these OP on SG, including a threeterm recursion formula and the asymptotics of the coefficients appearing in this recursion. Moreover, we develop numerical tools that allow us to graph a number of these OP. Finally, we use these numerical tools to investigate the structure of the zero and the nodal sets of these polynomials.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lee-Yang zeros and the Ising model on the Sierpinski Gasket

We study the distribution of the complex temperature zeros for the partition function of the Ising model on a Sierpinski gasket using an exact recursive relation. Although the zeros arrange on a curve pinching the real axis at T = 0 in the thermodynamic limit, their density vanishes asymptotically along the curve approaching the origin. This phenomenon explains the coincidence of the low temper...

متن کامل

Localization in fractal spaces: Exact results on the Sierpinski gasket.

Localization due to space structure, rather than due to randomness, is investigated by studying the usual tight-binding model on the Sierpinski gasket. Some exact results are obtained from the decimation —renormalization-group method. It is surprising that there exist an infinite number of extended states on the Sierpinski gasket. This set of extended states forms a Cantor set. The rest of the ...

متن کامل

Acyclic Edge-coloring of Sierpinski-like Graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by χ′a(G). Sierpinski graphs S(n, 3) are the graphs of the Tower of Hanoi with n disks, while Sierpinski gasket graphs Sn are the graphs naturally defined ...

متن کامل

On the existence of three solutions for the Dirichlet problem on the Sierpinski gasket

We apply a recently obtained three-critical-point theorem of B. Ricceri to prove the existence of at least three solutions of certain two-parameter Dirichlet problems defined on the Sierpinski gasket. We also show the existence of at least three nonzero solutions of certain perturbed two-parameter Dirichlet problems on the Sierpinski gasket, using both the mountain pass theorem of Ambrosetti an...

متن کامل

New Sierpenski Curves in Complex Plane

The Sierpinski triangle also known as Sierpinski gasket is one of the most interesting and the simplest fractal shapes in existence. There are many different and easy ways to generate a Sierpinski triangle. In this paper we have presented a new algorithm for generating the sierpinski gasket using complex variables.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012